Dense Induced Subgraphs of Dense Bipartite Graphs
نویسندگان
چکیده
منابع مشابه
Separation choosability and dense bipartite induced subgraphs
We study a restricted form of list colouring, for which every pair of lists that correspond to adjacent vertices may not share more than one colour. The optimal list size such that a proper list colouring is always possible given this restriction, we call separation choosability. We show for bipartite graphs that separation choosability increases with (the logarithm of) the minimum degree. This...
متن کاملFinding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs
This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subgraphs are interpreted as communities, as in, e.g., social networks. The problem of identifying dense subgraphs helps analyze graph structures and complex networks and it is known to be challenging. It bears some similarities ...
متن کاملFinding Dense Subgraphs of Sparse Graphs
We investigate the computational complexity of the Densestk-Subgraph (DkS) problem, where the input is an undirected graph G = (V,E) and one wants to find a subgraph on exactly k vertices with a maximum number of edges. We extend previous work on DkS by studying its parameterized complexity. On the positive side, we show that, when fixing some constant minimum density μ of the sought subgraph, ...
متن کاملDiscovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extremely efficient, capable of handling graphs with tens of billions of edges on a single machine with modest resources. We apply our algorithm to characterize the large, dense subgraphs of a graph showing connections between ...
متن کاملLarge planar subgraphs in dense graphs
We prove sufficient and essentially necessary conditions in terms of the minimum degree for a graph to contain planar subgraphs with many edges. For example, for all positive γ every sufficiently large graph G with minimum degree at least (2/3 + γ)|G| contains a triangulation as a spanning subgraph, whereas this need not be the case when the minimum degree is less than 2|G|/3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2021
ISSN: 0895-4801,1095-7146
DOI: 10.1137/20m1370744